# -*- coding: UTF-8 -*-
from typing import List
from leetcode_helper import TestcaseHelper, SolutionBase


class Solution(SolutionBase):
    # 解题的方法，命名和Leetcode的保持一致即可
    def divide(self, dividend: int, divisor: int) -> int:
        if dividend == 0:
            return 0

        sign = 1
        if dividend > 0 > divisor:
            sign = 0
        elif divisor > 0 > dividend:
            sign = 0

        ans = 0
        dividend = abs(dividend)
        divisor = abs(divisor)

        remain = dividend  # 余数
        result = 0  # 商
        while remain >= divisor:
            cur = 1  # 倍增商
            div = divisor  # 倍增值
            while div + div < remain:
                cur += cur
                div += div
            remain -= div  # 余数递减
            result += cur  # 商值累计

        if sign == 0:
            result = -result

        if result >= 2 ** 31:  # 按照题目要求，溢出处理
            result = 2 ** 31 - 1

        return result


if __name__ == '__main__':
    solution = Solution()

    # 按照leetcode的题目说明，将基本的test case填入
    # 每条case的最后一个元素是正确的结果，即期待的结果
    # 使用元组来保存输入的数据，期待的结果
    testcases = [
        (10, 3, 3),
        (7, -3, -2),
        (0, 1, 0),
        (1, 1, 1)
    ]

    for case_item in testcases:
        # 获取测试用的case和期待的执行结果
        input1 = case_item[0]
        input2 = case_item[1]

        expect = case_item[len(case_item) - 1]

        exec_result = solution.divide(input1, input2)

        # 判断执行结果，输出提示信息
        check_result = solution.check_result(expect, exec_result)
        TestcaseHelper.print_case(check_result, case_item, exec_result)

